A Simple Proof that Time-Invariant Convolutional Codes Attain Capacity
نویسندگان
چکیده
It is well known that time-varying convolutional codes can achieve the capacity of a discrete memoryless channel [1]. The time varying assumption is needed in the proof to assure pairwise independency between the codewords. In this work we provide a relatively simple proof that indeed time-invariant convolutional codes can achieve the capacity without any restriction (albeit, the error exponent achieved by our proof may not be the optimal).
منابع مشابه
A New Construction for Low Density Parity Check Convolutional Codes
Low density parity check (LDPC) block codes have been shown to achieve near capacity performance for binary transmission over noisy channels. Block codes, however, require splitting the data to be transmitted into frames, which can be a disadvantage in some applications. Convolutional codes, on the other hand, have no such requirement, and are hence well suited for continuous transmission. In [...
متن کاملA State Space Approach to Periodic Convolutional Codes
In this paper we study periodically time-varying convolutional codes by means of input-state-output representations. Using these representations we investigate under which conditions a given time-invariant convolutional code can be transformed into an equivalent periodic time-varying one. The relation between these two classes of convolutional codes is studied for period 2. We illustrate the id...
متن کاملImproved error exponent for time-invariant and periodically time-variant convolutional codes
An improved upper bound on the error probability (first error event) of time-invariant convolutional codes, and the resulting error exponent, is derived in this paper. The improved error bound depends on both the delay of the code and its width (the number of symbols that enter the delay line in parallel) . Determining the error exponent of time-invariant convolutional codes is an open problem....
متن کاملTurbo Lattices: Construction and Error Decoding Performance
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers (block interleavers) and nested convolutional codes i...
متن کاملTurbo Lattices: Construction and Performance Analysis
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers and nested convolutional codes is built. To this end,...
متن کامل